An almost general splitting theorem for modal logic
نویسنده
چکیده
Given a normal (multi-)modal logic Θ, a characterization is given of the finitely presentable algebras A whose logics LA split the lattice of normal extensions of Θ. This is a substantial generalization of [Rautenberg, 1980; Rautenberg, 1977] in which Θ is assumed to be weakly transitive and A to be finite. We also obtain as a direct consequence a result by [Blok, 1978] that for all cycle-free and finite A LA splits the lattice of normal extensions of K. Although we firmly believe it to be true, we have not been able to prove that if a logic Λ splits the lattice of extensions of Θ then Λ is the logic of an algebra finitely presentable over Θ; in this respect our result remains partial.
منابع مشابه
A Splitting Set Theorem for Epistemic Specifications
Over the past decade a considerable amount of research has been done to expand logic programming languages to handle incomplete information. One such language is the language of epistemic specifications. As is usual with logic programming languages, the problem of answering queries is intractable in the general case. For extended disjunctive logic programs, an idea that has proven useful in sim...
متن کاملRelevant Agents
In [4], Majer and Pelǐs proposed a relevant logic for epistemic agents, providing a novel extension of the relevant logic R with a distinctive epistemic modality K, which is at the one and the same time factive (Kφ → φ is a theorem) and an existential normal modal operator (K(φ ∨ ψ) → (Kφ ∨ Kψ) is also a theorem). The intended interpretation is that Kφ holds (relative to a situation s) if there...
متن کاملPrinciples of Knowledge Representation and Reasoning : Proceedings of the Second International Conference
A general method of automated modal logic theorem proving is discussed and illustrated. This method is based on the sub-stitutional framework for the development of systems for hybrid reasoning. Sentences in modal logic are translated into a constraint logic in which the constraints represent the connections between worlds in the possible world semantics for modal logic. Deduction in the constr...
متن کاملTopological Completeness of First-Order Modal Logics
As McKinsey and Tarski [20] showed, the Stone representation theorem for Boolean algebras extends to algebras with operators to give topological semantics for (classical) propositional modal logic, in which the “necessity” operation is modeled by taking the interior of an arbitrary subset of a topological space. This topological interpretation was recently extended in a natural way to arbitrary...
متن کاملar X iv : c s / 04 05 00 2 v 1 [ cs . A I ] 3 M ay 2 00 4 Splitting an operator Algebraic modularity results for logics with fixpoint semantics
It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different “levels”, such that the models of the entire program can be constructed by incrementally constructing models for each level. Similar results exist for other non-monotonic formalisms, such as auto-epistemic logic and defaul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 49 شماره
صفحات -
تاریخ انتشار 1990